Editorial: Shared Information and the Zero-Sum Mentality
نویسندگان
چکیده
منابع مشابه
Information Relaxations and Dynamic Zero-Sum Games
Dynamic zero-sum games are an important class of problems with applications ranging from evasion-pursuit and heads-up poker to certain adversarial versions of control problems such as multi-armed bandit and multiclass queuing problems. These games are generally very difficult to solve even when one player’s strategy is fixed, and so constructing and evaluating good sub-optimal policies for each...
متن کاملOn Zero-Sum and Almost Zero-Sum Subgraphs Over ℤ
For a graph H with at most n vertices and a weighing of the edges of Kn with integers, we seek a copy of H in Kn whose weight is minimal, possibly even zero. Of a particular interest are the cases where H is a spanning subgraph (or an almost spanning subgraph) and the case where H is a fixed graph. In particular, we show that relatively balanced weighings of Kn with {−r, . . . , r} guarantee al...
متن کاملOn Short Zero-sum Subsequences of Zero-sum Sequences
Abstract. Let G be a finite abelian group, and let η(G) be the smallest integer d such that every sequence over G of length at least d contains a zero-sum subsequence T with length |T | ∈ [1, exp(G)]. In this paper, we investigate the question whether all non-cyclic finite abelian groups G share with the following property: There exists at least one integer t ∈ [exp(G)+1, η(G)− 1] such that eve...
متن کاملA non-zero-sum no-information best-choice game
A given number of n applicants are to be interviewed for a position of secretary. They present themselves one-by-one in random order, all n! permutations being equally likely. Two players I and II jointly interview the i-th applicant and observe that his (or her) relative rank is y for I and z for II, relative to i − 1 applicants that have already seen (rank 1 is for the best). Each player choo...
متن کاملEvaluation of Economy in a Zero-sum Perfect Information Game
A zero-sum perfect information game is one where every player knows all the moves. Chess is a good example where the object is to checkmate or capture the enemy king. One important feature of checkmates, especially in chess problem composition, is economy. This paper proposes a computational function to evaluate the economy of checkmate configurations on the chessboard. Several experiments were...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Interfaces
سال: 1982
ISSN: 0092-2102,1526-551X
DOI: 10.1287/inte.12.5.31